PT-Scotch: A tool for efficient parallel graph ordering
نویسندگان
چکیده
The parallel ordering of large graphs is a difficult problem, because neither minimumdegree algorithms, nor the best graph partitioning methods that are necessary to nested dissection, parallelize or scale well. This paper presents a set of algorithms, implemented in the PT-Scotch software package, which allows one to order large graphs in parallel, yielding orderings the quality of which is equivalent to the one of state-of-the-art sequential algorithms.
منابع مشابه
Distillating knowledge about SCOTCH
Scotch is a software package for sequential and parallel graph partitioning, static mapping and sparse matrix ordering, and for sequential mesh/hypergraph ordering. It has been designed in a highly modular way, so that new methods can be easily added to it, in order for it to be used as a testbed for the design of new partitioning and ordering methods. This paper discusses the internal structur...
متن کاملEfficient and scalable parallel graph partitioning
The realization of efficient parallel graph partitioners requires the parallelization of the multi-level framework which is commonly used to improve the quality and speed of sequential partitioners. The two most critical issues in this framework are the coarsening phase, and the local refinement step performed in the uncoarsening phase. These two phases are difficult to parallelize, because the...
متن کاملAn Evaluation of the Zoltan Parallel Graph and Hypergraph Partitioners
Graph partitioning is an important and well studied problem in combinatorial scientific computing, and is commonly used to reduce communication in parallel computing. Different models (graph, hypergraph) and objectives (edge cut, boundary vertices) have been proposed. For large problems, the partitioning itself must be done in parallel. Several software packages, such as ParMetis, PT-Scotch and...
متن کاملNative mesh ordering with Scotch 4.0
Sparse matrix reordering is a key issue for the the efficient factorization of sparse symmetric matrices, not only to reduce fill-in and operation count, but also to increase concurrency in the elimination tree, which is essential to achieve high speed-ups when solving the systems on parallel architectures. Most sparse matrix reordering software, when applied to finite-element or finite-volume ...
متن کاملComparison of different propagation steps for lattice Boltzmann methods
We present a simple, parallel and distributed algorithm for setting up and partitioning a sparse representation of a regular discretized simulation domain. This method is scalable for a large number of processes even for complex geometries and ensures load balance between the domains, reasonable communication interfaces, and good data locality within the domain. Applying this scheme to a list-b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Computing
دوره 34 شماره
صفحات -
تاریخ انتشار 2008